Divide and Conquer: A Quick Scheme for Symbolic Regression

نویسندگان

چکیده

Symbolic regression aims to find a function that best explains the relationship between independent variables and objective value based on given set of sample data. Genetic programming (GP) is usually considered as an appropriate method for problem since it can optimize functional structure coefficients simultaneously. However, convergence speed GP might be too slow large scale problems involve number variables. Fortunately, in many applications, target separable or partially separable. This feature motivated us develop new method, divide conquer (D&C), symbolic regression, which divided into sub-functions are then determined by any algorithm. The separability probed proposed technique, Bi-Correlation test (BiCT). D&C powered has been tested some real-world study shows help get much more rapidly.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A divide and conquer method for symbolic regression

Symbolic regression aims to find a function that best explains the relationship between independent variables and the objective value based on a given set of sample data. Genetic programming (GP) is usually considered as an appropriate method for the problem since it can optimize functional structure and coefficients simultaneously. However, the convergence speed of GP might be too slow for lar...

متن کامل

Divide and Conquer Kernel Ridge Regression

We study a decomposition-based scalable approach to performing kernel ridge regression. The method is simple to describe: it randomly partitions a dataset of size N into m subsets of equal size, computes an independent kernel ridge regression estimator for each subset, then averages the local solutions into a global predictor. This partitioning leads to a substantial reduction in computation ti...

متن کامل

Divide and Conquer Local Average Regression

The divide and conquer strategy, which breaks a massive data set into a series of manageable data blocks, and then combines the independent results of data blocks to obtain a final decision, has been recognized as a state-of-the-art method to overcome challenges of massive data analysis. In this paper, we merge the divide and conquer strategy with local average regression methods to infer the r...

متن کامل

A Parallel Divide-and-Conquer Scheme for Delaunay Triangulation

This paper describes a parallel divide-and-conquer algorithm for Delaunay triangulation. This algorithm finds the affected zone that cover the triangulations that may be modified during the merge of two sub-block triangulations. With the aid of affected zone, communications between processors are reduced, the time complexity of divide-and-conquer remains O(n logn), and the affected zone can be ...

متن کامل

Parallel divide-and-conquer scheme for 2D Delaunay triangulation

This work describes a parallel divide-and-conquer Delaunay triangulation scheme. This algorithm finds the affected zone, which covers the triangulation and may be modified when two sub-block triangulations are merged. Finding the affected zone can reduce the amount of data required to be transmitted between processors. The time complexity of the divide-and-conquer scheme remains O(n log n), and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computational Methods

سال: 2021

ISSN: ['1793-6969', '0219-8762']

DOI: https://doi.org/10.1142/s0219876221420020